Optimal Constant Weight Codes

نویسنده

  • Igor Gashkov
چکیده

A new class of binary constant weight codes is presented. We establish new lower bound and exact values on A(n, 2k, k + 1), in particular, A(30, 12, 7) = 9, A(48, 16, 9) = 11, A(51,16, 9) = 12, A(58, 18, 10) = 12. An ( ) w d n , , constant weight binary code is a code of length n , code distance d in which all code words have the same number of “ones” . The number of “ones” is w . We will denote the maximal possible size (a number of code words) of an ( ) w d n , , constant weight code by ( ) w d n A , , . The most important and interesting problem is finding the largest possible size ( ) w d n A , , of an ( ) w d n , , constant weight code (hereafter called optimal code). The results of code searching used to be put in tables of optimal codes. The first lower bound appeared in 1977 in the book of MacWilliams and Sloane ([1], pp.684-691). A table of binary constant weight codes of length 28 ≤ n with explicit constructions for most of the 600 codes was presented in the encyclopedic work of E E. Brouwer, J. B. Shearer, N. J .A .Sloane [2]. Today Neil J. A. Sloane presents his table of constant weight codes [3] online and performs continual updates. Let us consider an ( ) 1 , 2 , + k k n constant weight code with length n , code distance k 2 and weight of all 1 + k . Johnson’s upper bound (se, [2], p. 525) in this case is n k kn k k n A − + ≤ + 2 ) 1 ( ) 1 , 2 , ( (if denominator is positive) (1) Theorem. 2 ) 1 , 2 , 2 2 3 ( 2 + = + + + = k k k k k n A holds for all k. The research was support by The Royal Swedish academy of Sciences. Proof. The code is constructed from representation 2 2 3 2 + + k k element set } 2 2 3 ,..., 3 , 2 , 1 { 2 + + = k k M as union of 2 + k subsets i M with 1 + k elements Optimal Constant Weight Codes 913 in every subset and j i M M ∩ =1 for j i ≠ . We now give explicit construction of the code. For 2 = k and } 6 , 5 , 4 , 3 , 2 , 1 { = M we can find 4 subsets } 6 , 5 , 4 { }, 6 , 3 , 2 { }, 5 , 3 , 1 { }, 4 , 2 , 1 { 4 3 2 1 = = = = M M M M where all vectors of constant weight code ( ) 3 , 4 , 6 are: ) 1 , 1 , 1 , 0 , 0 , 0 ( ) 1 , 0 , 0 , 1 , 1 , 0 ( ) 0 , 1 , 0 , 1 , 0 , 1 ( ) 0 , 0 , 1 , 0 , 1 , 1 (

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linear Size Optimal q-ary Constant-Weight Codes and Constant-Composition Codes

An optimal constant-composition or constant-weight code of weight has linear size if and only if its distance is at least . When , the determination of the exact size of such a constant-composition or constant-weight code is trivial, but the case of has been solved previously only for binary and ternary constant-composition and constant-weight codes, and for some sporadic instances. This paper ...

متن کامل

Optimal linear codes, constant-weight codes and constant-composition codes over $\Bbb F_{q}$

Optimal linear codes and constant-weight codes play very important roles in coding theory and have attached a lot of attention. In this paper, we mainly present some optimal linear codes and some optimal constant-weight codes derived from the linear codes. Firstly, we give a construction of linear codes from trace and norm functions. In some cases, its weight distribution is completely determin...

متن کامل

New explicit binary constant weight codes from Reed-Solomon codes

Binary constant weight codes have important applications and have been studied for many years. Optimal or near-optimal binary constant weight codes of small lengths have been determined. In this paper we propose a new construction of explicit binary constant weight codes from q-ary ReedSolomon codes. Some of our binary constant weight codes are optimal or new. In particular new binary constant ...

متن کامل

Optimal Doubly Constant Weight Codes

A doubly constant weight code is a binary code of length n1 + n2, with constant weight w1 + w2, such that the weight of a codeword in the first n1 coordinates is w1. Such codes have applications in obtaining bounds on the sizes of constant weight codes with givenminimum distance. Lower and upper bounds on the sizes of such codes are derived. In particular, we show tight connections between opti...

متن کامل

Optimal (v, 3, 1) binary cyclically permutable constant weight codes with small v

We classify up to multiplier equivalence optimal (v, 3, 1) binary cyclically permutable constant weight (CPCW) codes with v ≤ 61. There is a one-to-one correspondence between optimal (v, 3, 1) CPCW codes, optimal cyclic binary constant weight codes with weight 3 and minimal distance 4, (v, 3; b(v − 1)/6c) difference packings, and optimal (v, 3, 1) optical orthogonal codes. Therefore the classif...

متن کامل

Hanani triple packings and optimal q-ary codes of constant weight three

The exact sizes of optimal q-ary codes of length n, constant weightw and distance d = 2w− 1 have only been determined for q ∈ {2, 3}, and for w|(q − 1)n and n sufficiently large. We completely determine the exact size of optimal q-ary codes of constant weight three and minimum distance five for all q by establishing a connection with Hanani triple packings, and settling their existence.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006